A Multivariate Data Analysis Supporting System with Assumption-based Reasoning Function

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Assumption-Based Reasoning

In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of the Dempster-Shafer theory of evidence. Laskey, Lehner [1] and Provan [2] have already proposed a similar point of view but these papers do not emphasize the mathematical foundations of the probabilistic assumptionbas...

متن کامل

Assumption - Based Reasoning with Algebraic Clauses ∗

Ten years ago, de Kleer introduced assumption-based truth maintenance systems (ATMS) as a powerful tool for different applications in the domain of uncertain reasoning (de Kleer, 1986). A traditional ATMS is based on propositional logic, but it is limited to Horn clauses and to simple queries. An ATMS requires that there is a subset of propositions declared as assumptions. Assumptions are neede...

متن کامل

Assumption-Based Approaches to Reasoning with Priorities

This paper maps out the relation between different approaches for handling preferences in argumentation with strict rules and defeasible assumptions by offering translations between them. The systems we compare are: non-prioritized defeats, preference-based defeats, and preference-based defeats extended with reverse defeat. We prove that these translations preserve the consequences of the respe...

متن کامل

Assumption-Based Reasoning with Finite Set Constraints

In this paper we present an extension of the traditional approach to assumption-based reasoning. Instead of propositional logic we use the framework of finite set constraints. The idea is that a proposition x can also be considered as Boolean variable x ∈ {0, 1}. The literals x and ∼x are then represented by Boolean set constraints x ∈ {1} and x ∈ {0} respectively. More generally, arbitrary fin...

متن کامل

EQuIKa System: Supporting OWL applications with local closed world assumption

One of the major advantages of semantically annotating resources on Web is the facilitation of web services discovery. Languages based on OWL are prune to several problems for web services discovery due to the open-world assumption when handling incomplete information. Thus standard OWL reasoner are usually not suitable for the discovery purposes. The aforementioned problems can easily be fixed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Japanese journal of applied statistics

سال: 1994

ISSN: 0285-0370,1883-8081

DOI: 10.5023/jappstat.23.63